Network community detection via iterative edge removal in a flocking-like system
نویسندگان
چکیده
منابع مشابه
Network community detection via iterative edge removal in a flocking-like system
We present a network community-detection technique based on properties that emerge from a nature-inspired system of aligning particles. Initially, each vertex is assigned a random-direction unit vector. A nonlinear dynamic law is established so that neighboring vertices try to become aligned with each other. After some time, the system stops and edges that connect the least-aligned pairs of ver...
متن کاملQuad-pixel edge detection using neural network
One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...
متن کاملQuad-pixel edge detection using neural network
One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...
متن کاملCommunity Detection in Weighted Networks via Recursive Edge-Filtration
—In this paper, we present a Weighted Filtration Coefficient (WFC) and a corresponding filtration method to detect the communities in weighted networks. In our method, a weighted network can be divided into groups by recursive filtration operations, and the dividing results are evaluated by the . We prove that optimization on local enables us to obtain maximal global weighted modularity w...
متن کاملNetwork community detection with edge classifiers trained on LFR graphs
Graphs generated using the Lancichinetti-Fortunato-Radicchi (LFR) model are widely used for assessing the performance of network community detection algorithms. This paper investigates an laternative use of LFR graphs: as training data for learning classifiers that discriminate between edges that are ‘within’ a community and ‘between’ network communities. The LFR generator has a parameter that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal Special Topics
سال: 2021
ISSN: 1951-6355,1951-6401
DOI: 10.1140/epjs/s11734-021-00154-5